Post-Quantum Biometric Authentication Based on Homomorphic Encryption and Classic McEliece
نویسندگان
چکیده
Homomorphic encryption is a powerful mechanism that allows sensitive data, such as biometric to be compared in protected way, revealing only the comparison result when private key known. This very useful for non-device-centric authentication architectures with clients provide data and external servers authenticate them. While many reported solutions do not follow standards are resistant quantum computer attacks, this work proposes secure scheme applies homomorphic based on Classic McEliece public-key algorithm, which round 4 candidate of NIST post-quantum standardization process. The specific steps transform features extracted from samples. Its use proposed architecture ensures user privacy. Irreversibility, revocability unlinkability satisfied robust stolen-device, False-Acceptance Rate (FAR) similarity-based attacks well honest-but-curious servers. In addition security achieved by system, remains stable over 40 years proposal reduced storage communication overheads low computational cost. A practical implementation facial system illustrated generation FaceNet embeddings. Experimental results public databases show improves accuracy unprotected scheme, maintaining False-Rejection Rate, real-time execution parameter sets 128 256 bits (mceliece348864 mceliece6688128, respectively), reduces requirements more than 90.5% most reduced-size encryption-based schemes literature.
منابع مشابه
Quantum Search on Encrypted Data Based on Quantum Homomorphic Encryption
Here we propose a quantum search protocols on ciphered superposition state based on quantum homomorphic encryption where a client Alice with limited quantum ability can deliver her encrypted quantum data to a powerful but untrusted quantum search server and let the server search for her without decryption. By outsourcing the key-updating and interaction work to a trusted key center, the client ...
متن کاملQuantum fully homomorphic encryption scheme based on universal quantum circuit
Fully homomorphic encryption enables arbitrary computation on encrypted data without decrypting the data. Here it is studied in the context of quantum information processing. Based on universal quantum circuit, we present a quantum fully homomorphic encryption (QFHE) scheme, which permits arbitrary quantum transformation on an encrypted data. The QFHE scheme is proved to be perfectly secure. In...
متن کاملGhostshell: Secure Biometric Authentication using Integrity-based Homomorphic Evaluations
Biometric authentication methods are gaining popularity due to their convenience. For an authentication without relying on trusted hardwares, biometrics or their hashed values should be stored in the server. Storing biometrics in the clear or in an encrypted form, however, raises a grave concern about biometric theft through hacking or man-in-the middle attack. Unlike ID and password, once lost...
متن کاملOn Statistically-Secure Quantum Homomorphic Encryption
Homomorphic encryption is an encryption scheme that allows computations to be evaluated on encrypted inputs without knowledge of their raw messages. Recently Ouyang et al. constructed a quantum homomorphic encryption (QHE) scheme for Clifford circuits with statistical security (or information-theoretic security (IT-security)). It is desired to see whether an informationtheoretically-secure (ITS...
متن کاملPrivacy-Preserving Biometric Authentication and Matching via Lattice-Based Encryption
The continuous dependence on electronic media has radically changed our interactions, many of which are now performed online. In many occasions users need to authenticate to remote machines, but the hostile environment of the Internet may severely expose users and service providers. To counter these shortcomings, strong authentication is pushed forward. As a means to authenticate individuals, b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13020757